Recurrence relations for linear mating schemes
نویسندگان
چکیده
منابع مشابه
Linear Recurrence Relations for Graph Polynomials
A sequence of graphs Gn is iteratively constructible if it can be built from an initial labeled graph by means of a repeated fixed succession of elementary operations involving addition of vertices and edges, deletion of edges, and relabelings. Let Gn be a iteratively constructible sequence of graphs. In a recent paper, [27], M. Noy and A. Ribò have proven linear recurrences with polynomial coe...
متن کاملCommon Modulus and Chosen-Message Attacks on Public-Key Schemes with Linear Recurrence Relations
We consider the linear recurrence relation Vt (x)=∑mi=1(aix+bi )Vt−i(x)+ cx+f wherem> 1, ai and bi , 16 i 6m, are integers. The RSA and LUC schemes can be defined by this relation. In this paper we show that if the linear recurrence relation has some properties, the public-key scheme based on it cannot withstand the common modulus and chosen-message attacks, no matter what the order m is and wh...
متن کاملLinear Recurrence Relations for Binomial Coefficients modulo a Prime
We investigate when the sequence of binomial coefficients ( k i ) modulo a prime p, for a fixed positive integer k, satisfies a linear recurrence relation of (positive) degree h in the finite range 0 ≤ i ≤ k. In particular, we prove that this cannot occur if 2h ≤ k < p − h. This hypothesis can be weakened to 2h ≤ k < p if we assume, in addition, that the characteristic polynomial of the relatio...
متن کاملLinear Recurrence Relations for Sums of Products of Two Terms
For a sum of the form ∑ k F (n, k)G(n, k), we set up two systems of equations involving shifts of F (n, k) and G(n, k). Then we solve the systems by utilizing the recursion of F (n, k) and the method of undetermined coefficients. From the solutions, we derive linear recurrence relations for the sum. With this method, we prove many identities involving Bernoulli numbers and Stirling numbers.
متن کاملThe Solution of Linear Probabilistic Recurrence Relations 1
Linear probabilistic divide-and-conquer recurrence relations arise when analyzing the running time of divide-and-conquer randomized algorithms. We consider first the problem of finding the expected value of the random process T (x), described as the output of a randomized recursive algorithm T . On input x , T generates a sample (h1, . . . , hk) from a given probability distribution on [0, 1]k ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Indagationes Mathematicae (Proceedings)
سال: 1985
ISSN: 1385-7258
DOI: 10.1016/1385-7258(85)90007-1